- tree variant
- SAP.тех. вариант дерева
Универсальный англо-русский словарь. Академик.ру. 2011.
tree variant
Смотреть что такое "tree variant" в других словарях:
Tree Solitaire — Tree SolitaireTree solitaire is a special form of solitaire in which cards are laid out as follows: Row one One card Row two Two cards Row three Three cards Row four Four cards Row five Five cards Row six Six Cards Row seven Seven cardsAll rows… … Wikipedia
Hilbert R-tree — Hilbert R tree, an R tree variant, is an index for multidimensional objects like lines, regions, 3 D objects, or high dimensional feature based parametric objects. It can be thought of as an extension to B+ tree for multidimensional objects.The… … Wikipedia
roan-tree — variant of rowan tree … Useful english dictionary
cola tree — variant of kola tree … New Collegiate Dictionary
cola tree — variant of kola tree … Useful english dictionary
Steiner tree problem — Steiner tree for three points A, B, and C (note there are no direct connections between A, B, C). The Steiner point S is located at the Fermat point of the triangle ABC … Wikipedia
Fat tree — The fat tree network, invented by Charles E. Leiserson of MIT, is a universal network for provably efficient communication. Unlike an ordinary computer scientist s notion of a tree, which has skinny links all over, the links in a fat tree become… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
B+ tree — In computer science, a B+ tree is a type of tree which represents sorted data in a way that allows for efficient insertion, retrieval and removal of records, each of which is identified by a key . It is a dynamic, multilevel index, with maximum… … Wikipedia
Leftist tree — A leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Every node has an s value which is the distance to the nearest leaf. In contrast to a binary heap , a leftist tree attempts to be very unbalanced. In… … Wikipedia
Pacific Tree Frog — Conservation status Least Concern ( … Wikipedia
